- optimisation methods
- Логистика: методы оптимизации
Универсальный англо-русский словарь. Академик.ру. 2011.
optimisation methods
Смотреть что такое "optimisation methods" в других словарях:
Optimisation non linéaire — En optimisation, vue comme branche des mathématiques, l optimisation non linéaire (en anglais : nonlinear programming – NLP) s occupe principalement des problèmes d optimisation dont les données, i.e., les fonctions et ensembles définissant… … Wikipédia en Français
Optimisation aléatoire — L optimisation aléatoire (OA) est une famille de méthodes d optimisation numérique qui ne nécessite pas de connaître le gradient du problème pour être utilisée, comme dans le cas de fonctions non continues ou non différentiables. Ces méthodes… … Wikipédia en Français
Optimisation quadratique — En optimisation, qui est une branche des mathématiques, un problème d optimisation quadratique est un problème d optimisation dans lequel on minimise une fonction quadratique sur un polyèdre convexe. Les contraintes peuvent donc être décrites par … Wikipédia en Français
Multiphase topology optimisation — The Multi Phase Topology Optimisation is a simulation technique based on the principle of the finite element method which is able to determine the optimal distribution of two or more different materials in combination under thermal and mechanical … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Robustification — is a form of optimisation whereby a system is made less sensitive to the effects of random variability, or noise, that is present in that system’s input variables and parameters. The process is typically associated with engineering systems, but… … Wikipedia
Shape optimization — is part of the field of optimal control theory. The typical problem is to find the shape which is optimal in that it minimizes a certain cost functional while satisfying given constraints. In many cases, the functional being solved depends on the … Wikipedia
Network planning and design — is an iterative process, encompassing topological design, network synthesis, and network realization, and is aimed at ensuring that a new network or service meets the needs of the subscriber and operator.[1] The process can be tailored according… … Wikipedia
Global optimization — is a branch of applied mathematics and numerical analysis that deals with the optimization of a function or a set of functions to some criteria. General The most common form is the minimization of one real valued function f in the parameter space … Wikipedia
Modularity (networks) — For other uses, see Modularity. Modularity is one measure of the structure of networks or graphs. It measures the strength of division of a network into modules (also called groups, clusters or communities). Networks with high modularity have… … Wikipedia
Greedy algorithm — A greedy algorithm is any algorithm that follows the problem solving metaheuristic of making the locally optimum choice at each stage Paul E. Black, greedy algorithm in Dictionary of Algorithms and Data Structures [online] , U.S. National… … Wikipedia
